TSTP Solution File: ANA125^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ANA125^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:24:19 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 24 ( 5 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 88 ( 9 ~; 4 |; 1 &; 70 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 10 ^ 22 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
'type/realax/real': $tType ).
thf(decl_22,type,
'const/realax/real_mul': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(decl_23,type,
'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).
thf(decl_24,type,
esk1_0: 'type/realax/real' > 'type/realax/real' ).
thf(decl_25,type,
esk2_0: 'type/realax/real' ).
thf(decl_27,type,
esk4_2: 'type/realax/real' > ( 'type/realax/real' > 'type/realax/real' ) > 'type/realax/real' ).
thf('thm/iterate/POLYNOMIAL_FUNCTION_RMUL_',conjecture,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X3: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X1 @ X3 ) @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.H3zdMn5baS/E---3.1_19745.p','thm/iterate/POLYNOMIAL_FUNCTION_RMUL_') ).
thf('thm/iterate/POLYNOMIAL_FUNCTION_LMUL_',axiom,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X3: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.H3zdMn5baS/E---3.1_19745.p','thm/iterate/POLYNOMIAL_FUNCTION_LMUL_') ).
thf('thm/realax/REAL_MUL_SYM_',axiom,
! [X4: 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X4 @ X2 )
= ( 'const/realax/real_mul' @ X2 @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.H3zdMn5baS/E---3.1_19745.p','thm/realax/REAL_MUL_SYM_') ).
thf(c_0_3,negated_conjecture,
~ ! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X1 @ Z0 ) @ X2 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['thm/iterate/POLYNOMIAL_FUNCTION_RMUL_'])]) ).
thf(c_0_4,plain,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],['thm/iterate/POLYNOMIAL_FUNCTION_LMUL_']) ).
thf(c_0_5,negated_conjecture,
( ( 'const/iterate/polynomial_function' @ esk1_0 )
& ~ ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( esk1_0 @ Z0 ) @ esk2_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
! [X11: 'type/realax/real' > 'type/realax/real',X12: 'type/realax/real'] :
( ~ ( 'const/iterate/polynomial_function' @ X11 )
| ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X12 @ ( X11 @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_7,negated_conjecture,
~ ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( esk1_0 @ Z0 ) @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X1 @ Z0 ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X13: 'type/realax/real',X14: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X13 @ X14 )
= ( 'const/realax/real_mul' @ X14 @ X13 ) ),
inference(variable_rename,[status(thm)],['thm/realax/REAL_MUL_SYM_']) ).
thf(c_0_10,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( esk1_0 @ Z0 ) @ esk2_0 ) )
!= ( ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X1 @ Z0 ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(ext_sup,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
! [X3: 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X2 @ X3 )
= ( 'const/realax/real_mul' @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_mul' @ esk2_0 @ ( esk1_0 @ ( esk4_2 @ X2 @ X1 ) ) )
!= ( 'const/realax/real_mul' @ X2 @ ( X1 @ ( esk4_2 @ X2 @ X1 ) ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
'const/iterate/polynomial_function' @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ANA125^1 : TPTP v8.1.2. Released v7.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 09:58:42 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.H3zdMn5baS/E---3.1_19745.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.50 # Starting sh2lt with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_1 with 300s (1) cores
% 0.20/0.50 # ehoh_best8_lambda with pid 19843 completed with status 0
% 0.20/0.50 # Result found by ehoh_best8_lambda
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUSF-FFSF22-MSSFFFNN
% 0.20/0.50 # partial match(1): HHUSF-FFSF22-SSSFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 19846 completed with status 9
% 0.20/0.50 # Starting ehoh_best8_lambda with 31s (1) cores
% 0.20/0.50 # ehoh_best8_lambda with pid 19857 completed with status 0
% 0.20/0.50 # Result found by ehoh_best8_lambda
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUSF-FFSF22-MSSFFFNN
% 0.20/0.50 # partial match(1): HHUSF-FFSF22-SSSFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 19846 completed with status 9
% 0.20/0.50 # Starting ehoh_best8_lambda with 31s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 6
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 7
% 0.20/0.50 # Removed in clause preprocessing : 3
% 0.20/0.50 # Initial clauses in saturation : 4
% 0.20/0.50 # Processed clauses : 12
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 12
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 9
% 0.20/0.50 # ...of the previous two non-redundant : 6
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 4
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 2
% 0.20/0.50 # Equation resolutions : 1
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 3
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 8
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 3
% 0.20/0.50 # Current number of unprocessed clauses: 2
% 0.20/0.50 # ...number of literals in the above : 3
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 4
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 727
% 0.20/0.50 # Search garbage collected termcells : 68
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1764 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1724 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------